A sharper threshold for bootstrap percolation in two dimensions
نویسندگان
چکیده
منابع مشابه
Polluted Bootstrap Percolation with Threshold Two in All Dimensions
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it has at least r occupied neighbors. On the cubic lattice Z of dimension d ≥ 3 with threshold r = 2, we prove that the final density of occupied sites converges ...
متن کاملThe Metastability Threshold for Modified Bootstrap Percolation in d Dimensions
In the modified bootstrap percolation model, sites in the cube {1, . . . , L}d are initially declared active independently with probability p. At subsequent steps, an inactive site becomes active if it has at least one active nearest neighbour in each of the d dimensions, while an active site remains active forever. We study the probability that the entire cube is eventually active. For all d ≥...
متن کاملA conformal bootstrap approach to critical percolation in two dimensions
We study four-point functions of critical percolation in two dimensions, and more generally of the Potts model. We propose an exact ansatz for the spectrum: an infinite, discrete and non-diagonal combination of representations of the Virasoro algebra. Based on this ansatz, we compute four-point functions using a numerical conformal bootstrap approach. The results agree with Monte-Carlo computat...
متن کاملBootstrap Percolation in Three Dimensions
Abstract. By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of vertices ‘infected’ at time 0, new vertices are subsequently infected, at each time step, if they have at least r ∈ N previously infected neighbours. When the set A is chosen at random, the main aim is to determine the critical probability pc(G, r) at which percolation (infection of the...
متن کاملBootstrap Percolation in High Dimensions
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A ⊂ V (G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected neighbours. The set A is said to percolate if eventually all vertices are infected. Our aim is to understand this process on the grid, [n], for arbitrary functions n = n(t)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2010
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-010-0338-z